Espace Mémoire Événement (The Wire)

Complexité en espace de l'exploration de graphes

Graph Exploration is a problem motivated by several aspects of theoretical computer science, including logic and computational complexity. It has also numerous applications in robotics. In all these contexts, the amount of memory used by the mobile entity (robot, finite automaton, etc.) performing exploration is a key parameter. In this thesis, we study in depth the space complexity of graph ex...

A la mémoire de Max Wajskop

Max Wajskop, notre ami, notre collegue, directeur de l'lnstitut de Phon6tique de Bruxelles, 6diteur en Chef de Speech Communication et membre fondateur de I 'ESCA (European Speech Communication Association) est d4c6d~ le mardi 6 avril 1993. ll y a un an, accabl6 par la disparition de sa femmc Monique Hiann6, qui rut aussi sa collaboratrice pendant 30 ans, il ~tait lui-mame frappe par la maladie...

Blocs nuls dans la hiérarchie mémoire

e memory hierary undergoes a growing pressure. is pressure has been dueto the increasing frequency of the processors. However, now that the frequency staysaround 3 GHz, the number of execution cores and thus the number of processes runningsimultaneously are increasing.e growing number of requests handled by the memoryhierary leads to bandwidth saturation.is study shows...

Mémoire des Sciences de la Terre

Mémoire d ' Habilitation à Diriger les Recherches

Security is a very old concern, which until quite recently was mostly of interest for military purposes. The deployment of electronic commerce changes this drastically. The security of exchanges is ensured by cryptographic protocols which are notoriously error prone. The formal veri cation of cryptographic protocols is a di cult problem that can be seen as a particular model-checking problem in...